Random search - PDFSEARCH.IO - Document Search Engine

Random search
Results: 189

#	Item
41	Estimating PageRank on Graph Streams ATISH DAS SARMA, Georgia Institute of Technology SREENIVAS GOLLAPUDI and RINA PANIGRAHY, Microsoft Research This article focuses on computations on large graphs (e.g., the web-graph) Add to Reading List Source URL: www.cs.dartmouth.edu Language: English - Date: 2011-10-19 23:36:27 Network theory Link analysis Stochastic processes PageRank Search engine optimization Random walk Connectivity Shortest path problem Randomized algorithm Theoretical computer science Graph theory Mathematics
42	CS276 Cryptography Spring 2006 Lecture 19: Lecturer: David Wagner Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2015-01-21 19:48:43 Search algorithms Ciphertext indistinguishability Random oracle Advantage Hash function ElGamal encryption One-way function Optimal asymmetric encryption padding Probabilistic encryption Cryptography Cryptographic hash functions Hashing
43	Anytime Motion Planning using the RRT∗ Sertac Karaman Matthew R. Walter Alejandro Perez Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2014-11-19 14:27:00 Artificial intelligence Applied mathematics Robot control Rapidly-exploring random tree Combinatorial optimization Routing algorithms Motion planning A* search algorithm Anytime algorithm Search algorithms Theoretical computer science Mathematics
44	Reachability-Guided Sampling for Planning Under Differential Constraints Alexander Shkolnik, Matthew Walter, and Russ Tedrake Abstract— Rapidly-exploring Random Trees (RRTs) are widely used to solve large planning prob Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2014-11-19 14:27:01 Robot control Artificial intelligence Geometry Discrete geometry Motion planning Voronoi diagram Tree Nonholonomic system Bridge Search algorithms Mathematics Rapidly-exploring random tree
45	Asymptotically-optimal Path Planning for Manipulation using Incremental Sampling-based Algorithms Add to Reading List Source URL: ttic.uchicago.edu Language: English - Date: 2014-11-19 14:27:00 Search algorithms Motion planning Algorithm Collision detection Computer science Rapidly-exploring random tree Theoretical computer science Applied mathematics Mathematics
46	Asymptotic Optimality in Sampling-based Motion Planning Sertac Karaman Although one of the fundamental problems in robotics, the motion planning problem is inherently hard from a computational point of view. In particula Add to Reading List Source URL: www.cse.unr.edu Language: English - Date: 2012-12-20 19:29:35 Robot control Search algorithms Rapidly-exploring random tree Motion planning Algorithm Asymptotic computational complexity Asymptotically optimal algorithm Probabilistic roadmap Shortest path problem Applied mathematics Mathematics Theoretical computer science
47	Proceedings of Selected Areas in Cryptography ’98 (August 17–18, 1998, Kingston, Ontario, Canada) S. Tavares and H. Meijer Eds. Springer-Verlag, LNCS 1556, pages 72–80. Computational Alternatives to Random Number G Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2002-06-27 15:00:00 Hashing Search algorithms Schnorr signature Digital signature Random oracle One-way function Universal hashing RSA Hash function Cryptography Public-key cryptography Cryptographic hash functions
48	Notes on Randomized Algorithms CS: Fall 2014 James Aspnes:04 Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2014-12-17 20:04:41 Applied mathematics Hashing Randomized algorithm Method of conditional probabilities Universal hashing Chernoff bound Tabulation hashing Random walk Algorithm Search algorithms Mathematics Theoretical computer science
49	1 On the Effectiveness of Movement Prediction To Reduce Energy Consumption in Wireless Communication Srijan Chakraborty Yu Dong David K. Y. Yau John C. S. Lui Add to Reading List Source URL: www.cs.cuhk.hk Language: English - Date: 2004-09-25 01:51:20 Heuristics Game artificial intelligence Routing algorithms Technology A* search algorithm Science Random waypoint model Routing Mobility model Wireless networking Search algorithms Artificial intelligence
50	Batch Informed Trees (BIT): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs arXiv:1405.5848v6 [cs.RO] 26 FebJonathan D. Gammell1 , Siddhartha S. Srinivasa2 Add to Reading List Source URL: www.ri.cmu.edu Language: English* - Date: 2015-05-20 10:11:27 Search algorithms Combinatorial optimization Routing algorithms Rapidly-exploring random tree Robot control Shortest path problem A* search algorithm Graph Connectivity Mathematics Graph theory Theoretical computer science

UPDATE